Learning to recognize actionable static code warnings (is intrinsically easy)

Is code equivalence easy to decide?

We study the computational difficulty of deciding whether two matrices generate equivalent linear codes, i.e., codes that consist of the same codewords up to a fixed permutation on the codeword coordinates. We call this problem Code Equivalence. Using techniques from the area of interactive proofs, we show on the one hand, that under the assumption that the polynomial-time hierarchy does not co...

Is Code Equivalence Easy to Decide?

BYTEWEIGHT: Learning to Recognize Functions in Binary Code

Function identification is a fundamental challenge in reverse engineering and binary program analysis. For instance, binary rewriting and control flow integrity rely on accurate function detection and identification in binaries. Although many binary program analyses assume functions can be identified a priori, identifying functions in stripped binaries remains a challenge. In this paper, we pro...

Learning to recognize plankton

We present a system to recognize underwater plankton images from the Shadow Image Particle Profiling Evaluation Recorder. As some images do not have clear contours, we develop several features that do not heavily depend on the contour information. A soft margin support vector machine (SVM) was used as the classifier. We developed a new way to assign probability after multi-class SVM classificat...

Learning to recognize objects.

Evidence from neurophysiological and psychological studies is coming together to shed light on how we represent and recognize objects. This review describes evidence supporting two major hypotheses: the first is that objects are represented in a mosaic-like form in which objects are encoded by combinations of complex, reusable features, rather than two-dimensional templates, or three-dimensiona...